Decomposition of the diagonal map
نویسندگان
چکیده
منابع مشابه
Abel-Jacobi map, integral Hodge classes and decomposition of the diagonal
Given a smooth projective n-fold Y , with H3,0(Y ) = 0, the Abel-Jacobi map induces a morphism from each smooth variety parameterizing codimension 2-cycles in Y to the intermediate Jacobian J(Y ), which is an abelian variety. Assuming n = 3, we study in this paper the existence of families of 1-cycles in Y for which this induced morphism is surjective with rationally connected general fiber, an...
متن کاملEntanglement and output entropy of the diagonal map
We review some properties of the convex roof extension, a construction used, e.g., in the definition of the entanglement of formation. Especially we consider the use of symmetries of channels and states for the construction of the convex roof. As an application we study the entanglement entropy of the diagonal map for permutation symmetric real N = 3 states ω(z) and solve the case z < 0 where z...
متن کاملOn the decomposition map for symmetric groups
Let R be the Z-module generated by the irreducible characters of the symmetric group Sd . We determine bases for the kernel of the decomposition map. It is known that R ⊗Z F is isomorphic to the radical quotient of the Solomon descent algebra when F is a field of characteristic zero. We show that when F has prime characteristic and I d br is the kernel of the decomposition map for prime p then ...
متن کاملA Numerical Algorithm for Block-diagonal Decomposition of Matrix ∗-algebras
Motivated by recent interest in group-symmetry in the area of semidefinite programming, we propose a numerical method for finding a finest simultaneous block-diagonalization of a finite number of symmetric matrices, or equivalently the irreducible decomposition of the matrix ∗-algebra generated by symmetric matrices. The method does not require any algebraic structure to be known in advance, wh...
متن کاملDecomposition Bounds for Marginal MAP
Marginal MAP inference involves making MAP predictions in systems defined with latent variables or missing information. It is significantly more difficult than pure marginalization and MAP tasks, for which a large class of efficient and convergent variational algorithms, such as dual decomposition, exist. In this work, we generalize dual decomposition to a generic power sum inference task, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 2003
ISSN: 0040-9383
DOI: 10.1016/s0040-9383(01)00022-2